Interval Count Semi-Joins
نویسندگان
چکیده
Interval joins find applications in several domains, including temporal and spatial databases, uncertain data management, streaming data processing. In this paper, we study the evaluation of an interval count semi-join (ICS J ) operation that can be used for selecting or ranking intervals based on the number of join pairs they appear in. We extend the state-of-the-art algorithm for interval joins to evaluate ICS J at the cost of only scanning the sorted interval endpoints.
منابع مشابه
Index Based Processing of Semi-Restrictive Temporal Joins
Temporal joins are important but very costly operations. While a temporal join can involve the whole time (and/or key) domain, we consider the more general case where the join is defined by some time-key rectangle from the whole space (i.e., when the user is interested in joining portions of the –usually large– temporal data). In the most restrictive join, objects (within this rectangle) are jo...
متن کاملProcessing Inequality Queries
Bernstein and Goodman showed that natural inequality ( NI) queries can be processed efficiently by semijoins, if there are no multiple inequality join edges, nor cycles with one or zero doublet. In this paper procedures to hand1 e these cases efficiently are given. Multiple inequality join edges can be processed by multi-attribute inequality semijoins. Two procedures based on generalized semi-j...
متن کاملAnalysis of Joins and Semi Joins in a Distributed Database Query
Database is defined as collection of files or table, where as DBMS stands for Database Management System which is collection of unified programs used to manage overall activities of the database. The two dominant approaches used for storing and managing database are centralized database management system and distributed database management system in which data is placed at central location and ...
متن کاملSet-Similarity Joins Based Semi-supervised Sentiment Analysis
A set-similarity joins based semi-supervised approach is presented to mine Chinese sentiment words and sentences. The set-similarity joins is taken to join nodes in unconnected sub-graphs conducted by cutting the flow graph with Ford-Fulkerson algorithm into positive and negative sets to correct wrong polarities predicted by min-cut based semisupervised methods. Experimental results in digital,...
متن کاملQuery Acceleration in Distributed Database Systems
The advent of telecommunication era and the constant development of hardware and network structures have encouraged the decentralization of data while increasing the needs to access information from different sites. Query optimization strategies aim to minimize the cost of transferring data across networks. Many techniques and algorithms have been proposed to optimize queries. Perhaps one of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018